Equivalence of decomposable and 2-decomposable operators
نویسندگان
چکیده
منابع مشابه
On the decomposable numerical range of operators
Let $V$ be an $n$-dimensional complex inner product space. Suppose $H$ is a subgroup of the symmetric group of degree $m$, and $chi :Hrightarrow mathbb{C} $ is an irreducible character (not necessarily linear). Denote by $V_{chi}(H)$ the symmetry class of tensors associated with $H$ and $chi$. Let $K(T)in (V_{chi}(H))$ be the operator induced by $Tin text{End}(V)$. Th...
متن کاملon the decomposable numerical range of operators
let $v$ be an $n$-dimensional complex inner product space. suppose $h$ is a subgroup of the symmetric group of degree $m$, and $chi :hrightarrow mathbb{c} $ is an irreducible character (not necessarily linear). denote by $v_{chi}(h)$ the symmetry class of tensors associated with $h$ and $chi$. let $k(t)in (v_{chi}(h))$ be the operator induced by $tin text{end}(v)$. the...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملDecomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints. Certain classes of these non-binary constraints are “network decomposable” as they can be represented by binary constraints on the same set of variables. We compare theoretically the levels of consistency which are achieved o...
متن کاملDecomposable theories
We present in this paper a general algorithm for solving first-order formulas in particular theories called decomposable theories. First of all, using special quantifiers, we give a formal characterization of decomposable theories and show some of their properties. Then, we present a general algorithm for solving first-order formulas in any decomposable theory T . The algorithm is given in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1978
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1978.77.243